منابع مشابه
Beyond Keywords and Hierarchies
As our ability to store information increases, the mechanisms we employ to access that information become ever more important. In this paper, we present Archosum, a prototype of an organizational system that attempts to encapsulate the benefits of both hierarchical and keyword systems. By introducing abstract entities, Archosum provides a simple interface with which users can build and maintain...
متن کاملMarkets and Hierarchies: Some Elementary Considerations
The principal purposes of this paper are to examine the factors which induce a shift of transactions from market to internal organization and, within internal organization, to explain the types of hierarchical relations that predictably emerge. It is generally acknowledged that a prima facie case for the development of nonmarket (or quasi-market) forms of economic organization can be said to ex...
متن کاملRelating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies
We show that some natural re nements of the Straubing and Brzozowski hierarchies correspond (via the so called leaf-languages) step by step to similar re nements of the polynomial-time hierarchy. This extends a result of H.-J. Burtschik and H. Vollmer on relationship between the Straubing and the polynomial hierarchies. In particular, this applies to the boolean hierarchy and the plus{hierarchy.
متن کاملInteracting with Huge Hierarchies: Beyond Cone Trees
This paper describes an implementation of a tool for visualizing and interacting with huge information hierarchies, and some preliminary empirical evaluation of the tool’s efficacy. Existing systems for visualizing huge hierarchies using cone trees ‘‘break down” once the hierarchy to be displayed exceeds roughly 1000 nodes, due to increasing visual clutter. This paper describes a system called ...
متن کاملOn the Complexity of Contraction Hierarchies
Contraction Hierarchies are an experimentally well studied method to efficiently handle point-topoint shortest-path queries in large graphs. In a preprocessing stage the vertices of the input graph are iteratively removed, while the shortest-path structure of the remaining graph is preserved. This results in a hierarchy of graphs and shortest-path queries can be answered by only considering edg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computation Theory
سال: 2016
ISSN: 1942-3454,1942-3462
DOI: 10.1145/2858784